Computability of a function with jumps
نویسندگان
چکیده
منابع مشابه
Asymptotically Minimax Estimation of a Function with Jumps
Asymptotically minimax nonparametric estimation of a regression function observed in white Gaussian noise over a bounded interval is considered, with respect to a L 2-loss function. The unknown function f is assumed to be m times diierentiable except for an unknown, though nite, number of jumps, with piecewise mth derivative bounded in L 2-norm. An estimator is constructed, attaining the same o...
متن کاملinterpersonal function of language in subtitling
translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...
15 صفحه اولComputability properties of the Gau ian function
We speculate on the Gau ian function [x] as an example of a noncontinuous function which is nevertheless possessed of some properties of computability. An algorithm how to compute [x] for a single computable real number is rst described, followed by a remark that [x] does not necessarily preserve sequential computability. Second, [x] is studied in the light of the notion of upper semi-computabi...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولSequential Computability of a Function: Diagonal Space and Limiting Recursion
We consider the real sequences in I = [0, 1) and real functions on I . A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called Dcomputability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2005
ISSN: 0166-8641
DOI: 10.1016/j.topol.2003.12.017